It is Hard to Know when Greedy is Good for Finding Independent Sets
نویسندگان
چکیده
The classes Ar and Sr are de ned as the classes of those graphs, where the minimum degree greedy algorithm always approximates the maximum independent set (MIS) problem within a factor of r, respectively, where this algorithm has a sequence of choices that yield an output that is at most a factor r from optimal, r 1 a rational number. It is shown that deciding whether a given graph belongs to Ar is coNP-complete for any xed r 1, and deciding whether a given graph belongs to S1 is DP-hard, and belongs to 2P. Also, the MIS problem remains NP-complete when restricted to Sr.
منابع مشابه
Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملFitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کاملA Tool for Binding Threads to Processors
Many multiprocessor systems are based on distributed shared memory. It is often important to statically bind threads to processors in order to avoid remote memory access, due to performance. Finding a good allocation takes long time and it is hard to know when to stop searching for a better one. It is sometimes impossible to run the application on the target machine. The developer needs a tool ...
متن کاملMolecular dynamics simulation of a binary mixture lubricant for use in hard disk interfaces
In Hard Disk Drives (HDD), it is necessary to decrease the Flying Height (FH) between the head and the disk (currently, FH is around 3-5 nm) so as to increase recording densities. Retaining the solid lubricant has become a difficult proposition owing to intermittent contact between the surfaces. ZTMD and Z are used as solid lubricant to lubricate these interfaces. In this paper, the behavior of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 61 شماره
صفحات -
تاریخ انتشار 1997